Bounds for the Adiabatic Approximation with Applications to Quantum Computation
نویسندگان
چکیده
We present straightforward proofs of estimates used in the adiabatic approximation. The gap dependence is analyzed explicitly. We apply the result to interpolating Hamiltonians of interest in quantum computing. Supported by the Deutsche Forschungsgemeinschaft (DFG) Partially supported by the National Security Agency (NSA) and Advanced Research and Development Activity (ARDA) under Army Research Office (ARO) contract number DAAD19-02-10065, and by the National Science Foundation under Grant DMS-0314228. Supported by the Deutsche Forschungsgemeinschaft (DFG)
منابع مشابه
A note on adiabatic theorem for Markov chains and adiabatic quantum computation
We derive an adiabatic theorem for Markov chains using well known facts about mixing and relaxation times. We discuss the results in the context of the recent developments in adiabatic quantum computation.
متن کاملApproximability of Optimization Problems through Adiabatic Quantum Computation
Read more and get great! That's what the book enPDFd approximability of optimization problems through adiabatic quantum computation synthesis lectures on quantum computing will give for every reader to read this book. This is an on-line book provided in this website. Even this book becomes a choice of someone to read, many in the world also loves it so much. As what we talk, when you read more ...
متن کاملLocality bounds on hamiltonians for stabilizer codes
In this paper, we study the complexity of Hamiltonians whose groundstate is a stabilizer code. We introduce various notions of k-locality of a stabilizer code, inherited from the associated stabilizer group. A choice of generators leads to a Hamiltonian with the code in its groundspace. We establish bounds on the locality of any other Hamiltonian whose groundspace contains such a code, whether ...
متن کاملTowards fault tolerant adiabatic quantum computation.
I show how to protect adiabatic quantum computation (AQC) against decoherence and certain control errors, using a hybrid methodology involving dynamical decoupling, subsystem and stabilizer codes, and energy gaps. Corresponding error bounds are derived. As an example, I show how to perform decoherence-protected AQC against local noise using at most two-body interactions.
متن کاملLeveraging Adiabatic Quantum Computation for Election Forecasting
Accurate, reliable sampling from fully-connected graphs with arbitrary correlations is a difficult problem. Such sampling requires knowledge of the probabilities of observing every possible state of a graph. As graph size grows, the number of model states becomes intractably large and efficient computation requires full sampling be replaced with heuristics and algorithms that are only approxima...
متن کامل